Proof of a Conjecture of a Pitts

نویسندگان

  • I Moerdijk
  • J C Vermeulen
  • Andrew Pitts
چکیده

Introduction In this paper we prove a conjecture of Andrew Pitts which states that the Beck Chevalley condition holds for lax pullbacks or comma squares of coherent toposes see Theorem below Pitts conjecture was put forward as a way towards the lax descent theorem for coherent toposes Theorem below The latter entails a dual version for pretoposes which was eventually established by Zawadowski in the setting of Makkai s elaborate theory of Stone duality Our results therefore furnish a proof of the lax descent theorem for pretoposes along the lines originally conceived by Pitts As explained in Zawadowski s paper this theorem can be interpreted as a very general de nability result for coherent logic Perhaps surprisingly our proof of Pitts conjecture needs only simple properties of inverse limits and localization of coherent toposes which are all at least implicitly contained in We have tried to give an accesssible presentation of these properties in the rst sections of this paper Moreover our arguments are completely constructive and valid over an arbitrary base topos We would like to point out that independently yet another proof has recently been given of the descent theorem for pretoposes by David Ballard and Bill Boshuck This elegant proof also uses methods of model theory and seems unrelated to our approach The results of this paper were rst announced at the meeting Geometrical and Logical Aspects of Descent Theory at Oberwolfach September We would like to acknowledge the generous support of the Dutch NWO which made possible a visitor s appointment of the second author at Utrecht

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A short proof of the maximum conjecture in CR dimension one

In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...

متن کامل

On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture

The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...

متن کامل

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

Partial proof of Graham Higman's conjecture related to coset diagrams

Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

متن کامل

A Brief Determination of Certain Class of Power Semicircle Distribution

In this paper, we give a new and direct proof for the recently proved conjecture raised in Soltani and Roozegar (2012). The conjecture can be proved in a few lines via the integral representation of the Gauss-hypergeometric function unlike the long proof in Roozegar and Soltani (2013).

متن کامل

Frankl's Conjecture for a subclass of semimodular lattices

 In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997